Chebyshev acceleration of iterative refinement
نویسندگان
چکیده
منابع مشابه
Consensus acceleration in multiagent systems with the Chebyshev semi-iterative method
We consider the fundamental problem of reaching consensus in multiagent systems. To date, the consensus problem has been typically solved with decentralized algorithms based on graph Laplacians. However, the convergence of these algorithms is often too slow for many important multiagent applications, and thus they are increasingly being combined with acceleration methods. Unfortunately, state-o...
متن کاملParallel Quasi-chebyshev Acceleration to Nonoverlapping Multisplitting Iterative Methods Based on Optimization
In this paper, we present a parallel quasi-Chebyshev acceleration applied to the nonoverlapping multisplitting iterative method for the linear systems when the coefficient matrix is either an H-matrix or a symmetric positive definite matrix. First, m parallel iterations are implemented in m different processors. Second, based on l1-norm or l2-norm, the m optimization models are parallelly treat...
متن کاملChebyshev acceleration of the GeneRank algorithm∗
The ranking of genes plays an important role in biomedical research. The GeneRank method of Morrison et al. [11] ranks genes based on the results of microarray experiments combined with gene expression information, for example from gene annotations. The algorithm is a variant of the well known PageRank iteration, and can be formulated as the solution of a large, sparse linear system. Here we sh...
متن کاملCoupled Harmonic Equations , SOR , and Chebyshev Acceleration
A coupled pair of harmonic equations is solved by the application of Chebyshev acceleration to the Jacobi, Gauss-Seidel, and related iterative methods, where the Jacobi iteration matrix has purely imaginary (or zero) eigenvalues. Comparison is made with a block SOR method used to solve the same problem. Introduction. In [4], we proposed a general block SOR method for solving the biharmonic equa...
متن کاملIterative Treebank Refinement
Treebanks are a valuable resource for the training of parsers that perform automatic annotation of unseen data. It has been shown that changes in the representation of linguistic annotation have an impact on the performance of a certain annotation task. We focus on the task of Topological Field Parsing for German using Probabilistic Context-Free Grammars in the present research. We investigate ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Algorithms
سال: 2013
ISSN: 1017-1398,1572-9265
DOI: 10.1007/s11075-013-9750-7